Proof: Suppose for any strings of length upto L and even blues, it is unsolvable (establish base case for L=1,2,3 by exhaustive listing), then for a (L+1), regardless of which blue is taken out, you will have one substring of length <=L and even blues.